An Analysis of Connectivity of k - ary n - cubem - diag Interconnection Networks
نویسنده
چکیده
The diierence among diierent topologies in interconnection networks is a debated issue among highly parallel machine designers, since opposing parameters innuence the network performance. This paper presents a new model, k-ary n-cube m-diags, which generalizes existing k-ary n-cube topologies to include hexagonal networks and their n-dimensional extensions. A performance analysis based on this model is conducted, showing that the increase of connectivity in low-dimensional networks by means of diagonal links results in better latency and throughput in the network. An algorithm for routing messages in k-ary n-cube m-diags is proposed, showing the relative ease of performing this task on such topologies.
منابع مشابه
Extra connectivity measures of 3-ary n-cubes
The h-extra connectivity is an important parameter to measure the reliability and fault tolerance ability of large interconnection networks. The k-ary ncube is an important interconnection network of parallel computing systems. The 1-restricted connectivity of k-ary n-cubes has been obtained by Chen et al. for k ≥ 4 in [6]. Nevertheless, the h-extra connectivity of 3-ary ncubes has not been obt...
متن کاملk-Restricted edge connectivity for some interconnection networks
k-Restricted edge connectivity is an important parameter in measuring the reliability and fault tolerance of large interconnection networks. In this paper we present two families of graphs similar with the networks proposed by Chen et al. [Y.C. Chen, J.J.M. Tan, L.H. Hsu, S.S. Kao, Super-connectivity and super edge-connectivity for some interconnection networks, Applied Mathematics and Computat...
متن کامل3-extra Connectivity of K-ary N-cube Networks
Let G be a connected graph and S be a set of vertices. The h-extra connectivity of G is the cardinality of a minimum set S such that G − S is disconnected and each component of G− S has at least h + 1 vertices. The h-extra connectivity is an important parameter to measure the reliability and fault tolerance ability of large interconnection networks. The h-extra connectivity for h = 1, 2 of k-ar...
متن کاملAugmented k-ary n-cubes
We define an interconnection network AQn,k which we call the augmented kary n-cube by extending a k-ary n-cube in a manner analogous to the existing extension of an n-dimensional hypercube to an n-dimensional augmented cube. We prove that the augmented k-ary n-cube AQn,k has a number of attractive properties (in the context of parallel computing). For example, we show that the augmented k-ary n...
متن کاملRestricted connectivity for three families of interconnection networks
Vertex connectivity and edge connectivity are two important parameters in interconnection networks. Even though they reflect the fault tolerance correctly, they undervalue the resilience of large networks. By the concept of conditional connectivity and super-connectivity, the concept of restricted vertex connectivity and restricted edge connectivity of graphs was proposed by Esfahanian [A.H. Es...
متن کامل